Synthesizing trees by plantons
نویسندگان
چکیده
منابع مشابه
Synthesizing trees from samples
In this paper, we propose a novel tree modeling approach, synthesizing new trees from samples. First, we capture real world trees as samples by image-based modeling or laser scanning techniques. Then, we present a two-level statistical tree model and design a maximum likelihood estimation algorithm to extract it from samples. At the low level in the tree model, groups of similar organs are clus...
متن کاملOutlier Detection by Boosting Regression Trees
A procedure for detecting outliers in regression problems is proposed. It is based on information provided by boosting regression trees. The key idea is to select the most frequently resampled observation along the boosting iterations and reiterate after removing it. The selection criterion is based on Tchebychev’s inequality applied to the maximum over the boosting iterations of ...
متن کاملSynthesizing Invariants by Solving Solvable Loops
When proving invariance properties of a program, we face two problems. The first problem is related to the necessity of proving tautologies of considered assertion language, whereas the second manifests in the need of finding sufficiently strong invariants. This paper focuses on the second problem and describes a new method for the automatic generation of loop invariants that handles polynomial...
متن کاملSpread-Spectrum Watermark by Synthesizing Texture
Image watermarking is a mapping from watermark message to a set of image counterparts, where every version conveys the same meaning with the original image. Since textures that present single perceptual meaning have certain diversity, an intuitive idea of watermarking is to replace the texture region of an image with a similar-looking synthetic texture containing the watermark. We propose a spr...
متن کاملSynthesizing Hot Code Paths by Abductive Reasoning
Many SPMD programs suffer from divergence in control flow and memory accesses, e.g. when handling boundary conditions. While often only few work items diverge, a vectorizing compiler has to generate code that handles all of them. In general, this leads to overhead even for work groups that show no divergence. We present a novel optimization that synthesizes conditionals using abductive reasonin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Visual Computer
سال: 2006
ISSN: 0178-2789,1432-2315
DOI: 10.1007/s00371-006-0002-x